Approximating optimum branchings in linear time

Approximating solution of fully fuzzy linear systems in dual form

On the Approximation of Pseudo Linear Systems by Linear Time Varying Systems (RESEARCH NOTE)

This paper presents a modified method for approximating nonlinear systems by a sequence of linear time varying systems. The convergence proof is outlined and the potential of this methodology is discussed. Simulation results are used to show the effectiveness of the proposed method.

A New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming

‎This paper describes a new optimization method for solving continuous semi-infinite linear problems‎. ‎With regard to the dual properties‎, ‎the problem is presented as a measure theoretical optimization problem‎, ‎in which the existence of the solution is guaranteed‎. ‎Then‎, ‎on the basis of the atomic measure properties‎, ‎a computation method was presented for obtaining the near optimal so...

Fully Dynamic Maintenance of Optimum Directed Spanning Forests

We present and analyze a fully dynamic algorithm for maintaining minimum cost directed spanning forests (branchings) in the presence of arc deletions and insertions. We provide algorithms that maintain a data structure, when an arc is deleted from or inserted in the digraph. Queries to the data structure for the optimum branching are answered in O(n) time, while the cost of an optimum branching...

Software for weighted structured low-rank approximation

A software package is presented that computes locally optimal solutions to low-rank approximation problems with the following features: • mosaic Hankel structure constraint on the approximating matrix, • weighted 2-norm approximation criterion, • fixed elements in the approximating matrix, • missing elements in the data matrix, and • linear constraints on an approximating matrix’s left kernel b...